Multi-tape Automata for Speech and Language Systems: A Prolog Implementation
نویسندگان
چکیده
This paper describes a Prolog implementation of multi-tape nite-state automata and illustrates its use with a rewrite rules system. Operators which are multi-tape speciic are deened and algorithms for constructing their behaviour into multi-tape machines are given.
منابع مشابه
NLP Applications Based on Weighted Multi-Tape Automata
This article describes two practical applications of weighted multi-tape automata (WMTAs) in Natural Language Processing, that demonstrate the augmented descriptive power of WMTAs compared to weighted 1-tape and 2-tape automata. The two examples concern the preservation of intermediate results in transduction cascades and the search for similar words in two languages. As a basis for these appli...
متن کاملMonitoring PVM Programs Using the DAMS Approach
Monitoring tools are fundamental components of a development environment as they provide basic support for performance evaluation, debugging, and program visualization. We describe our experiments with several monitoring tools for PVM, namely XPVM, developed at ORNL, Tape/PVM, developed at IMAG Lab, and DAMS, developed at UNL. These tools are compared and their use is described to support instr...
متن کاملAsynchronous Multi-Tape Automata Intersection: Undecidability and Approximation
When their reading heads are allowed to move completely asynchronously, finite-state automata with multiple tapes achieve a significant expressive power, but also lose useful closure properties—closure under intersection, in particular. This paper investigates to what extent it is still feasible to use multi-tape automata as recognizers of polyadic predicates on words. On the negative side, det...
متن کاملRevisiting Multi-Tape Automata for Semitic Morphological Analysis and Generation
Various methods have been devised to produce morphological analyzers and generators for Semitic languages, ranging from methods based on widely used finitestate technologies to very specific solutions designed for a specific language or problem. Since the earliest proposals of how to adopt the elsewhere successful finite-state methods to root-andpattern morphologies, the solution of encoding Se...
متن کاملMulti-tape automata for automatic verification
This paper discusses how finite-state automata with multiple tapes can be used to construct decision procedures for fragments of first-order theories with interpreted functions and relations, useful in the verification of programs. There is a natural correspondence between automata accepting input on n > 1 tapes and predicates over n variables, but multi-tape automata that read input asynchrono...
متن کامل